RNA folding kinetics using Monte Carlo and Gillespie algorithms
نویسندگان
چکیده
منابع مشابه
RNA folding kinetics using Monte Carlo and Gillespie algorithms.
RNA secondary structure folding kinetics is known to be important for the biological function of certain processes, such as the hok/sok system in E. coli. Although linear algebra provides an exact computational solution of secondary structure folding kinetics with respect to the Turner energy model for tiny ([Formula: see text]20 nt) RNA sequences, the folding kinetics for larger sequences can ...
متن کاملAll-atom Monte Carlo simulation of GCAA RNA folding.
We report a detailed all-atom simulation of the folding of the GCAA RNA tetraloop. The GCAA tetraloop motif is a very common and thermodynamically stable secondary structure in natural RNAs. We use our simulation methods to study the folding behavior of a 12-base GCAA tetraloop structure with a four-base helix adjacent to the tetraloop proper. We implement an all-atom Monte Carlo (MC) simulatio...
متن کاملThe folding thermodynamics and kinetics of crambin using an all-atom Monte Carlo simulation.
We present a novel Monte Carlo simulation of protein folding, in which all heavy atoms are represented as interacting hard spheres. This model includes all degrees of freedom relevant to folding, all side-chain and backbone torsions, and uses a Go potential. In this study, we focus on the 46 residue alpha/beta protein crambin and two of its structural components, the helix and helix hairpin. Fo...
متن کاملRNA hairpin-folding kinetics.
Based on the complete ensemble of hairpin conformations, a statistical mechanical model that combines the eigenvalue solutions of the rate matrix and the free-energy landscapes has been able to predict the temperature-dependent folding rate, kinetic intermediates, and folding pathways for hairpin-forming RNA sequences. At temperatures higher than a "glass transition" temperature, T(g), the eige...
متن کاملPopulation Monte Carlo algorithms
We give a cross-disciplinary survey on “population” Monte Carlo algorithms. In these algorithms, a set of “walkers” or “particles” is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms – ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Biology
سال: 2017
ISSN: 0303-6812,1432-1416
DOI: 10.1007/s00285-017-1169-7